Efficient Approximation for Triangulation of Minimum Treewidth
نویسنده
چکیده
Finding triangulations of minimum treewidth for graphs is central to many problems in computer science. Real-world problems in artificial intelligence, VLSI design and databases are efficiently solvable if we have an efficient approximation algorithm for this problem. In this paper we present a simple approximation algorithm for finding triangulations of minimum treewidth. The algorithm produces factor-3 approximations in time O(2kn), where n, k are the number of nodes and the treewidth of the given graph, G, respectively. This time bound is significantly better than previously achieved for any constant-factor approximation for this problem. We report on experimental results confirming the effectiveness of our algorithm.
منابع مشابه
Listing All Potential Maximal Cliques of a Graph
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal triangulation of that graph. It is known that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum 5ll-in are polynomially tractable for these graphs. We show here that the potential maximal cliques of a graph can be generated in polynomial time i...
متن کاملLight spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs
Grigni and Hung [10] conjectured that H-minor-free graphs have (1 + )-spanners that are light, that is, of weight g(|H|, ) times the weight of the minimum spanning tree for some function g. This conjecture implies the efficient polynomial-time approximation scheme (PTAS) of the traveling salesperson problem in H-minor free graphs; that is, a PTAS whose running time is of the form 2f( )nO(1) for...
متن کاملAll Roads Lead To Rome—New Search Methods for Optimal Triangulation
To perform efficient inference in Bayesian networks, the network graph needs to be triangulated. The quality of this triangulation largely determines the efficiency of the subsequent inference, but the triangulation problem is unfortunately NP-hard. It is common for existing methods to use the treewidth criterion for optimality of a triangulation. However, this criterion may lead to a somewhat ...
متن کاملApproximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Various parameters of graphs connected to sparse matrix factoriza-tion and other applications can be approximated using an algorithm of Leighton et al. that nds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth, and minimum elimination tree height, are no more than O(logn) (minimum front size and treewidth) and O(log 2 ...
متن کاملTreewidth of planar graphs: connection with duality
A graph is said to be chordal if each cycle with at least four vertices has a chord, that is an edge between two non-consecutive vertices of the cycle. Given an arbitrary graph G = (V, E), a triangulation of G is a chordal graph H(= V, F) such that E ⊆ F. We say that H is a minimal triangulation of G if no proper subgraph of H is a triangulation of G. The treewidth tw(H) of a chordal graph is i...
متن کامل